Crosscorrelation of Rudin-Shapiro-Like Polynomials
نویسندگان
چکیده
We consider the class of Rudin-Shapiro-like polynomials, whose L norms on the complex unit circle were studied by Borwein and Mossinghoff. The polynomial f(z) = f0 + f1z + · · ·+ fdz d is identified with the sequence (f0, f1, . . . , fd) of its coefficients. From the L 4 norm of a polynomial, one can easily calculate the autocorrelation merit factor of its associated sequence, and conversely. In this paper, we study the crosscorrelation properties of pairs of sequences associated to Rudin-Shapiro-like polynomials. We find an explicit formula for the crosscorrelation merit factor. A computer search is then used to find pairs of Rudin-Shapiro-like polynomials whose autocorrelation and crosscorrelation merit factors are simultaneously high. Pursley and Sarwate proved a bound that limits how good this combined autocorrelation and crosscorrelation performance can be. We find infinite families of polynomials whose performance approaches quite close to this fundamental limit.
منابع مشابه
The Mahler Measure of the Rudin-shapiro Polynomials
Littlewood polynomials are polynomials with each of their coefficients in {−1, 1}. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro polynomials. It is shown in this paper that the Mahler measure and the maximum modulus of the Rudin-Shapiro polynomials on the unit circle of the complex plane h...
متن کاملMoments of the Rudin-Shapiro Polynomials
We develop a new approach of the Rudin-Shapiro polynomials. This enables us to compute their moments of even order q for q 32, and to check a conjecture on the asymptotic behavior of these moments for q even and q 52.
متن کاملRudin-Shapiro-Like Polynomials with Maximum Asymptotic Merit Factor
Borwein and Mossinghoff investigated the Rudin-Shapirolike polynomials, which are infinite families of Littlewood polynomials, that is, polynomials whose coefficients are all in {−1, 1}. Each family of Rudin-Shapiro-like polynomials is obtained from a starting polynomial (which we call the seed) by a recursive construction. These polynomials can be regarded as binary sequences. Borwein and Moss...
متن کاملRudin-Shapiro-like polynomials in L4
We examine sequences of polynomials with {+1,−1} coefficients constructed using the iterations p(x) → p(x) ± xd+1p∗(−x), where d is the degree of p and p∗ is the reciprocal polynomial of p. If p0 = 1 these generate the Rudin-Shapiro polynomials. We show that the L4 norm of these polynomials is explicitly computable. We are particularly interested in the case where the iteration produces sequenc...
متن کاملEven moments of generalized Rudin-Shapiro polynomials
We know from Littlewood (1968) that the moments of order 4 of the classical Rudin–Shapiro polynomials Pn(z) satisfy a linear recurrence of degree 2. In a previous article, we developed a new approach, which enables us to compute exactly all the moments Mq(Pn) of even order q for q 32. We were also able to check a conjecture on the asymptotic behavior of Mq(Pn), namely Mq(Pn) ∼ Cq2, where Cq = 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.07697 شماره
صفحات -
تاریخ انتشار 2017